Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices

نویسندگان

  • Yuan Li
  • Haibin Kan
چکیده

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz a first type COD if and only if Oz does not contain submatrix (

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex Orthogonal Designs with Forbidden 2 × 2 Submatrices

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz an M-type COD if and only if Oz does not contain submatrix (

متن کامل

Amicable complex orthogonal designs

In this letter, we define amicable complex orthogonal designs (ACOD) and propose two systematic methods to construct higher-order ACOD’s from lower-order ACOD’s. Although the upper bound on the number of variables of ACOD’s is found to be the same as that of amicable orthogonal designs (AOD), we show that certain types of AOD’s that were previously shown to be non-existent or undecided, such as...

متن کامل

Two complex orthogonal space-time codes for eight transmit antennas

Two complex orthogonal space-time codes for eight transmit antennas" (2004). Two new constructions of complex orthogonal space-time block codes of order 8 based on the theory of amicable orthogonal designs are presented and their performance compared with that of the standard code of order 8. These new codes are suitable for multi-modulation schemes where the performance can be sacrificed for a...

متن کامل

Recognizing Balanceable Matrices

A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...

متن کامل

Some constructions for amicable orthogonal designs

Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications in coding theory, cryptography, wireless network communication and so on. Product designs were introduced by Robinson in order to construct orthogonal designs especially full orthogonal designs (no zero entries) with maximum number of variables for some orders. He constructed product designs of o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011